Line Histogram - A Fast Method for Rotated Rectangular Area Histogramming
نویسندگان
چکیده
We propose a novel approach to executing exhaustive histogram search, which incorporates a process to rotate the template used in a computationally efficient manner, e.g. for tracking applications where object rotation will require template rotation. The method is particularly applicable to rectangular templates as any rotation in the region of interest will greatly reduce the potential for a satisfactory match. We present a computational analysis of our proposed method, followed by comparative experimental results.
منابع مشابه
Reconfigurable Mesh Algorithms For The Area And Perimeter Of Image Components And Histogramming*
We consider the following image processing problems: compute the area and perimeter of the components of an image, compute the histogram of an image, and histogram modification. Parallel reconfigurable mesh computer algorithms are developed for these problems. The area and perimeter of the components of an N×N image are computed in O (logN) time by an N×N RMESH; the histogram of an N×N image is...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملHistogram Sort with Sampling
To minimize data movement, state-of-the-art parallel sorting algorithms use sampling and histogramming techniques to partition keys prior to redistribution. Samples enable partitioning to be done using representative subset of the keys, while histogramming enables evaluation and iterative improvement of a given partitioning. We introduce Histogram sort with sampling (HSS), which combines sampli...
متن کاملA New Weighted Region-based Hough Transform Algorithm for Robust Line Detection in Poor Quality Images of 2D Lattices of Rectangular Objects
In this work we present a novel kernel-based Hough Transform method for robust line detection in poor quality images of 2D lattices of rectangular objects. Following a preprocessing stage that specifies the connected regions of the image, the proposed method uses a kernel to specify each region’s voting strength based on the following shape descriptors: a) its rectangularity, b) the orientation...
متن کامل